Rankings of information and library science journals by JIF and by h%2Dtype indices.

The effects of background information and social interaction on image tagging.

A generic framework for collaborative multi%2Dperspective ontology acquisition.

Citations to the %22Introduction to informetrics%22 indexed by WOS
Contents lists available at ScienceDirect
Web of Science with the Conference Proceedings Citation Indexes the case of computer science.

Comparing university rankings.


Presentation bias is significant in determining user preference for search results %2D A user study.


PIM %40 academia how e%2Dmail is used by scholars.

Scholarly collaboration between Europe and Israel A scientometric examination of a changing landscape.

The lifespan of %22informetrics%22 on the Web An eight year study %281998%2D2006%29.

A generic framework for collaborative multi%2Dperspective ontology acquisition.

A generic framework for collaborative multi%2Dperspective ontology acquisition.

Informetrics at the beginning of the 21st century %2D A review.

Structured versus unstructured tagging a case study.

Which h%2Dindex%3F %2D A comparison of WoS%2C Scopus and Google Scholar.

Comparing Typical Opening Move Choices Made by Humans and Chess Engines.

Google Bombing from a Time Perspective.

Popularity and findability through log analysis of search terms and queries the case of a multilingual public service website.

Some measures for comparing citation databases.

Children as architects of Web directories An exploratory study.

User rankings of search engine results.

Analysis of Queries Reaching SHIL on the Web %2D An Information System Providing Citizen Information.

Comparing Typical Opening Move Choices Made by Humans and Chess Engines

Methods for comparing rankings of search engine results.

False Web memories A case study on finding information about Andrei Broder.

Mike Thelwall
There have been many attempts to study the content of the web, either through human or automatic agents. Five different previously used web survey methodologies are described and analysed, each justifiable in its own right, but a simple experiment is presented that demonstrates concrete differences between them. The concept of crawling the web also bears further inspection, including the scope of the pages to crawl, the method used to access and index each page, and the algorithm for the identification of duplicate pages. The issues involved here will be well-known to many computer scientists but, with the increasing use of crawlers and search engines in other disciplines, they now require a public discussion in the wider research community. This paper concludes that any scientific attempt to crawl the web must make available the parameters under which it is operating so that researchers can, in principle, replicate experiments or be aware of and take into account differences between methodologies. A new hybrid random page selection methodology is also introduced.
An ego%2Dcentric citation analysis of the works of Michael O. Rabin based on multiple citation indexes.

Methods for comparing rankings of search engine results

Web links and search engine ranking The case of Google and the query %22jew%22.

Methods for comparing rankings of search engine results

Comparing Move Choices of Chess Search Engines.
Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and the POWERBOOK opening book as representing human choices. We collected the top-5 ranked moves and their scores as reported by FRITZ and JUNIOR, after 15 and 30 minutes of thinking time, and the top-5 moves recorded in the POWERBOOK, for the Nunn2 test positions and the initial board position. The data analysis was carried out using several nonparametric measures, including the amount of overlap in the top-5 choices of the engines and their association as measured by three variants of Spearman’s footrule. Our preliminary results show that, overall, the engines differ substantially in their choice of moves, and, furthermore, the engines ’ choices also differ substantially from human choice. 1.
Comparing Move Choices of Chess Search Engines.
Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and the POWERBOOK opening book as representing human choices. We collected the top-5 ranked moves and their scores as reported by FRITZ and JUNIOR, after 15 and 30 minutes of thinking time, and the top-5 moves recorded in the POWERBOOK, for the Nunn2 test positions and the initial board position. The data analysis was carried out using several nonparametric measures, including the amount of overlap in the top-5 choices of the engines and their association as measured by three variants of Spearman’s footrule. Our preliminary results show that, overall, the engines differ substantially in their choice of moves, and, furthermore, the engines ’ choices also differ substantially from human choice. 1.
What do we know about links and linking%3F A framework for studying links in academic environments.

Comparing rankings of search results on the Web.

How do search engines respond to some non%2DEnglish queries%3F

Information hub blogs.

From the search problem through query formulation to results on the web.

The anthrax scare and the Web A content analysis of Web pages linking to resources on anthrax.

An outsider%27s view on %22topic%2Doriented blogging%22.
The number of Web blogs is growing extremely fast, thus this phenomenon cannot be ignored. This paper discusses the issue through monitoring a set of blogs for a two months period in September-October 2003 and characterizing these blogs based on descriptive statistics and content analysis.
Search Engine Ability to Cope With the Changing Web.

Evolution
his 50th birthday. Our aim is to study the probable structure of a random graph rn N which has n given labelled vertices P, P2,..., Pn and N edges; we suppose
Self%2Dlinking and self%2Dlinked rates of academic institutions on the Web.

A microscopic link analysis of academic institutions within a country %2D the case of Israel.

How do search engines handle non%2DEnglish queries%3F %2D A case study.

Modern Hebrew literature on the Web a content analysis.

Informetric Theories and Methods for Exploring the Internet An Analytical Survey of Recent Research Literature.

Methods for measuring search engine performance over time.

Informetric Theories and Methods for Exploring the Internet An Analytical Survey of Recent Research Literature.

Methods for Measuring Search Engine Performance over Time.

Generalized submodular cover problems and applications.

The Web as an information source on informetrics%3F A content analysis.
method of locating potentially relevant articles on a given subject by identifying subsequent articles that cite a previously published article. An important feature of Google Scholar is that researchers can use it to trace interconnections among authors citing articles on the same topic and to determine the frequency with which others cite a specific article, as it has a “cited by &amp;quot; feature. This study begins with Background of the study Eugene Garfield first outlined the idea of a unified citation index to the literature of science in 1955. “Citation indexes resolve semantic problems associated with traditional subject indexes by using citation symbology rather than words to describe the content of a document ” (Weinstock 1971). Eugene Garfield’s main purpose in proposing the construction of a citation index for science, in which the references in scientific articles are used as index terms, was for the citation index to function as an information retrieval tool for scientific information (Garfield 1955). The rationale behind this kind of indexing is to exploit what Garfield calls the “association-of-ideas ” or “Citations are the formal, explicit linkages between papers that have particular points in common ” (Garfield 1979, 1). Soon after the beginning of the World Wide Web, the literature available on the Web increased very rapidly. The growing amount of literature on the Web and the need for multidisciplinary information retrieval accentuated the need for improved retrieval methods because while the documents were readily available, locating them
Evaluating the stability of the search tools Hotbot and Snap a case study.

On the cost of recomputing Tight bounds on pebbling with faults.
www.elsevier.com/locate/tcs
Proceedings of the Sisth Conference of the International Society for Scientometrics and Informetrics

Internet Use by Faculty Members in Various Disciplines A Comparative Case Study.

Generalized Submodular Cover Problems and Applications.

Scheduling Jobs Using Common Resources.

On the Cost of Recomputing Tight Bounds on Pebbling with Faults.
www.elsevier.com/locate/tcs
How to Allocate Network Centers.
This paper deals with the issue of allocating and utilizing centers in a distributed  network, in its various forms. The paper discusses the significant parameters of center  allocation, defines the resulting optimization problems, and proposes several approximation  algorithms for selecting centers and for distributing the users among them. We  concentrate mainly on balanced versions of the problem, i.e., in which it is required  that the assignment of clients to centers be as balanced as possible. The main results  are constant ratio approximation algorithms for the balanced -centers and balanced  -weighted centers problems, and logarithmic ratio approximation algorithms for the  ae-dominating set and the k-tolerant set problems.  School of Library and Information, The Hebrew University, Jerusalem 9xxxx, Israel. This work was carried out while the author was with the Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science.  y  Department of Applied M...
Distributed Resource Allocation Algorithms %28Extended Abstract%29.

Random Leaders and Random Spanning Trees.

Approximation Algorithms for Selecting Network Centers %28Preliminary Vesion%29.

Non%2DCryptographic Fault%2DTolerant Computing in Constant Number of Rounds of Interaction.

Random Leaders and Random Spanning Trees.

